Online Algorithms and the k - server problem — June 14 , 2011
نویسنده
چکیده
Finally, we wrap-up this lecture with our new result which achieves a competitive factor of Õ(log k log n) for the k-server problem on n nodes1. This is joint work with Nikhil Bansal, Niv Buchbinder, and Aleksander Madry. Our basic approach is based on the framework of [CMP08]. The key idea in our work is that instead of using the allocation problem (as suggested by [CMP08]), we use the fractional allocation problem to construct a fractional algorithm for the k-server problem. It is fairly easy to convert the fractional (deterministic) algorithm into a randomized (integral) algorithm.
منابع مشابه
A CSA Method for Assigning Client to Servers in Online Social Networks
This paper deals with the problem of user-server assignment in online social network systems. Online social network applications such as Facebook, Twitter, or Instagram are built on an infrastructure of servers that enables them to communicate with each other. A key factor that determines the facility of communication between the users and the servers is the Expected Transmission Time (ETT). A ...
متن کاملTrackless online algorithms for the server problem
A class of “simple” online algorithms for the k-server problem is identified. This class, for which the term trackless is introduced, includes many known server algorithms. The k-server conjecture fails for trackless algorithms. A lower bound of 23/11 on the competitiveness of any deterministic trackless 2-server algorithm and a lower bound of 1 + √2/2 on the competitiveness of any randomized t...
متن کاملThe k-server problem
The k-server problem is perhaps the most influential online problem: natural, crisp, with a surprising technical depth that manifests the richness of competitive analysis. The k-server conjecture, which was posed more that two decades ago when the problem was first studied within the competitive analysis framework, is still open and has been a major driving force for the development of the area...
متن کاملA randomized on-line algorithm for the k-server problem on a line
We give a O(n 2 3 logn)–competitive randomized k–server algorithm when the underlying metric space is given by n equally spaced points on a line. For n = k+o(k 3 2/ log k), this algorithm is o(k)–competitive.
متن کاملT-Theory Applications to Online Algorithms for the Server Problem
Although largely unnoticed by the online algorithms community, T-theory, a field of discrete mathematics, has contributed to the development of several online algorithms for the k-server problem. A brief summary of the k-server problem, and some important application concepts of T-theory, are given. Additionally, a number of known k-server results are restated using the established terminology ...
متن کامل